Non-Local Configuration of Component Interfaces by Constraint Satisfaction

© 2020 Springer-Verlag. The final publication is available at Springer via https://doi.org/10.1007/s10601-020-09309-y.Service-oriented computing is the paradigm that utilises services as fundamental elements for developing applications. Service composition, where data consistency becomes especially important, is still a key challenge for service-oriented computing. We maintain that there is one aspect of Web service communication on the data conformance side that has so far escaped the researchers attention. Aggregation of networked services gives rise to long pipelines, or quasi-pipeline structures, where there is a profitable form of inheritance called flow inheritance. In its presence, interface reconciliation ceases to be a local procedure, and hence it requires distributed constraint satisfaction of a special kind. We propose a constraint language for this, and present a solver which implements it. In addition, our approach provides a binding between the language and C++, whereby the assignment to the variables found by the solver is automatically translated into a transformation of C++ code. This makes the C++ Web service context compliant without any further communication. Besides, it uniquely permits a very high degree of flexibility of a C++ coded Web service without making public any part of its source code.Peer reviewe

Knockdown of ZNF268, which Is Transcriptionally Downregulated by GATA-1, Promotes Proliferation of K562 Cells

The human ZNF268 gene encodes a typical KRAB-C2H2 zinc finger protein that may participate in hematopoiesis and leukemogenesis. A recent microarray study revealed that ZNF268 expression continuously decreases during erythropoiesis. However, the molecular mechanisms underlying regulation of ZNF268 during hematopoiesis are not well understood. Here we found that GATA-1, a master regulator of erythropoiesis, repressed the promoter activity and transcription of ZNF268. Electrophoretic mobility shift assays and chromatin immunoprecipitation assays showed that GATA-1 directly bound to a GATA binding site in the ZNF268 promoter in vitro and in vivo. Knockdown of ZNF268 in K562 erythroleukemia cells with specific siRNA accelerated cellular proliferation, suppressed apoptosis, and reduced expression of erythroid-specific developmental markers. It also promoted growth of subcutaneous K562-derived tumors in nude mice. These results suggest that ZNF268 is a crucial downstream target and effector of GATA-1. They also suggest the downregulation of ZNF268 by GATA-1 is important in promoting the growth and suppressing the differentiation of K562 erythroleukemia cells

Efficient weakly-constrained codes for mitigation of patterning effects in digital communications

“This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder." “Copyright IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.” DOI: 10.1109/ICUMT.2009.5345526We propose specific modulation block codes for weakly-constrained coding and demonstrate that their performance is close to the theoretical limit. We also show that when such codes are used for the mitigation of patterning effects in optical fibre communications, a gain of about 1 dB is possible under realistic conditions, if only at the expense of small redundancy (¿ 10%).Peer reviewe

The error statistics analysis of the QPSK-modulated signal in the high-rate optical link

A model of an optical fibre communication line operating at 80 Gb/s with QPSK modulation format is studied numerically. The error statistics and patterning effects are analyzed and nonlinear transmission impairments of the optical signal are quantified. Also the advanced detection scheme is proposed.Peer reviewedSubmitted Versio

Reduction of nonlinear intrachannel effects by channel asymmetry in transmission lines with strong bit overlapping

Copyright IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. --DOI : 10.1109/LPT.2003.818061Peer reviewe

The analysis of the error statistics in a 5 x 40 Gbit/s fibre link with hybrid amplification

Original article can be found at : http://sciencedirect.com/ Copyright ElsevierWe quantify the error statistics and patterning effects in a 5 × 40 Gbit/s WDM RZ-OOK SMF/DCF fibre link using hybrid Raman/EDFA amplification. By extensive use of a numerical model, we determine how the error statistics change with the transmission distance. This knowledge is used as a basis for a constrained coding technique in order to improve the transmission error rate. We propose an adaptive constrained code for mitigation of the patterning effects and demonstrate that this approach can substantially reduce the bit error rate (BER) even for very large values of the channel BER (BER > 10- 1). The proposed technique can be used in combination with forward error correction schemes (FEC) to extend the range of channel BERs that an FEC scheme is effective over.Peer reviewedFinal Accepted Versio

Teaching mathematical explanation through audiographic technology

Original article can be found at: http://www.sciencedirect.com/science/journal/03601315 Copyright Elsevier Ltd. [Full text of this article is not available in the UHRA]Peer reviewe

Asynchronous Stream Processing with S-Net

© The Author(s) 2010. This article is published with open access at Springerlink.comWe present the rationale and design of S-Net, a coordination language for asynchronous stream processing. The language achieves a near-complete separation between the application code, written in any conventional programming language, and the coordination/communication code written in S-Net. Our approach supports a component technology with flexible software reuse. No extension of the conventional language is required. The interface between S-Net and the application code is in terms of one additional library function. The application code is componentised and presented to S-Net as a set of components, called boxes, each encapsulating a single tuple-to-tuple function. Apart from the boxes defined using an external compute language, S-Net features two built-in boxes: one for network housekeeping and one for data-flow style synchronisation. Streaming network composition under S-Net is based on four network combinators, which have both deterministic and nondeterministic versions. Flexible software reuse is comprehensive, with the box interfaces and even the network structure being subject to subtyping. We propose an inheritance mechanism, named flow inheritance, that is specifically geared towards stream processing. The paper summarises the essential language constructs and type concepts and gives a short application example.Peer reviewe

Modes Detection of Color Histogram and Merging Algorithm by Mode Adjacency Graph Analysis for Color Image Segmentation

International audienceIn this work we present an approach for color image segmentation based on pixel classification. Such methods are based on the assumption that meaningful regions are defined by homogeneous colors and give rise to compact clusters in the color space. Each cluster defined a class of pixels which share similar color properties The construction of the pixel classes is performed by detecting the modes of the color histogram of the image. To identify these modes, mathematical morphology techniques are used. The application of watersheds on the color histogram leads to an over partitioning of the color plane, which can be processed by mode merging algorithms based on mode adjacency graph analysing. Depending the merging criterion we present in this paper two merging algorithms, the first relies on the gravity centers of the modes as a merging criterion, and in the second we introduce a new merging criterion: the spatial-color compactness degree